On Nevanlinna's proximity function
نویسندگان
چکیده
منابع مشابه
compactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولOn best proximity points for multivalued cyclic $F$-contraction mappings
In this paper, we establish and prove the existence of best proximity points for multivalued cyclic $F$- contraction mappings in complete metric spaces. Our results improve and extend various results in literature.
متن کاملSemantic Proximity Search on Heterogeneous Graph by Proximity Embedding
Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineeri...
متن کاملGrouping Based on Phenomenal Proximity.
The question was raised whether the Gestalt law of grouping by proximity is based on proximity of stimuli on the retina or perceived proximity in phenomenal space. To tease apart these 2 possibilities an earlier experiment of Corbin was repeated in which the stimulus array is tilted back into the 3rd dimension. By including a measure of constancy for the perceived distance between points it was...
متن کاملOn K-word Proximity Search
When we search from a huge amount of documents, we often specify several keywords to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. As the result, the search result contains some meaningless documents. In this paper, we propose two algorithms for nding documents in which all given keywords appear in neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Series A I Mathematica
سال: 1982
ISSN: 0066-1953
DOI: 10.5186/aasfm.1982.0710